Tabu search for the linear ordering problem with cumulative costs
نویسندگان
چکیده
منابع مشابه
Tabu search for the linear ordering problem with cumulative costs
Given a matrix of weights, the Linear Ordering Problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This well known NP-complete problem can also be formulated on a complete weighted graph, where the objective is to find an acyclic tournament that maximizes the sum of arc weights. The variant of the LOP that we...
متن کاملThe Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory terms by introducing a complete digraph G = (V, A) whose vertices v ∈ V := {1, · · · , n} correspond to the n items to be sorted. Depending on the cost function to be be used, different optimization problems can be defi...
متن کاملMetaheuristics for the linear ordering problem with cumulative costs
The linear ordering problem with cumulative costs (LOPCC) is a variant of the well-known linear ordering problem, in which a cumulative propagation makes the objective function highly non-linear. The LOPCC has been recently introduced in the context of mobile-phone telecommunications. In this paper we propose two metaheuristic methods for this NP-hard problem. The first one is based on the GRAS...
متن کاملImproving Iterated Local Search Solution for the Linear Ordering Problem with Cumulative Costs (LOPCC)
In this paper the linear ordering problem with cumulative costs is approached. The best known algorithm solution for the problem is the tabu search proposed by Duarte. In this work an experimental study was performed to evaluate the intensification and diversification balance between these phases. The results show that the heuristic construction phase has a major impact on the tabu search algor...
متن کاملHybrid GRASP with Composite Local Search And Path-Relinking for the Linear Ordering Problem with Cumulative Costs
In this paper a GRASP algorithm hybridized with a composite local search and path-relinking is proposed to solve the linear ordering problem with cumulative costs. Our approach consists on adding a composite local search that helps to produce diverse good solutions and improve them trough a truncated path-relinking with local search. The computational results show that the GRASP algorithm finds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2009
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-009-9270-5